Attribute Computations in the DPoPb Graph Transformation Engine

One of the challenges of attributed graph rewriting systems concerns the implementation of attribute computations. Most of the existing systems adopt the standard algebraic approach where graphs are attributed using sigma-algebras. However, for the sake of efficiency considerations and convenient uses, these systems do not generally implement the whole attribute computations but rely on programs written in a host language. In previous works we introduced the Double Pushout Pullback (DPoPb) framework which integrates attributed graph rewriting and computation on attributes in a unified categorical approach. This paper discusses the DPoPb’s theoretical and practical advantages when using inductive types and lambda-calculus. We also present an implementation of the DPoPb system in the Haskell language which thoroughly covers the semantics of this graph rewriting system

Dress ensemble

Suit dress of red raw silk. a) red jacket has short sleeves; white collar; novelty chrome fastenings; lined with pure silk; b) dress has sheer white organza sleeveless bodice with cowl/roll collar. Red skirt with double inverted pleats and natural waistline. Label: Size 5 LOUIS FERAUD, Paris, Franc

Mohair jacket

Jacket of pink mohair; flat roll collar with rounded points; piping from neckline to side seam; center front closure; armhole princess seams at back; black lining with designer's name in small pocket with a quote from the designer on it

Interoperability and Granularity: Some limits of Corba

In order to discuss Corba granularity, we present two case studies addressing fine grained objects (the Hector system), and coarse grained ones (Corba applicability in CAD Airplane). Finally we give a synthesis of some Corba limits which are very similar in both cases.

Incorporating Proofs in a Categorical Attributed Graph Transformation System for Software Modelling and Verification

This paper deals with model transformations based on attributed graphs transformation. Our approach is based on the categorical approach called Single Pushout. The principal goal being to strengthen the attribute computation part, we generalize our earlier approach based on the use of typed lambda-terms with inductive types and recursion to represent attributes and computation functions. The generalized approach takes terms in variable context as attributes and partial proofs as computation functions that permit to combine computation with proof development and verification. The intended domains of application are the development of cerified software models and semantics models for interactive proof development and verification

Image reconstruction from the 1997 Ipswich data using conjugate-gradient

International audienceThe conjugate gradient algorithm is shown to be effective in reconstructing targets from experimental radar measurements. Enhancement, using the reciprocity relation to complete the scattered data, is also shown. The small number of iterations needed to obtain a satisfying solution (less than 50 iterations), combined with the increasing computation power of new processors (an SGI R10000 needs 30 sec to compute one iteration), make it possible for this algorithm to be used for practical applications

A Model Driven Approach For Information System Migration

International audienc

Attribute Computations in the DPoPb Graph Transformation Engine

Abstract: One of the challenges of attributed graph rewriting systems concerns the implementation of attribute computations. Most of the existing systems adopt the standard algebraic approach where graphs are attributed using sigma-algebras. However, for the sake of efficiency considerations and convenient uses, these systems do not generally implement the whole attribute computations but rely on programs written in a host language. In previous works we introduced the Double Pushout Pullback (DPoPb) framework which integrates attributed graph rewriting and computation on attributes in a unified categorical approach. This paper discusses the DPoPb’s theoretical and practical advantages when using inductive types and lambda-calculus. We also present an implementation of the DPoPb system in the Haskell language which thoroughly covers the semantics of this graph rewriting system

La Juridiction française dans les échelles du Levant et de Barbarie... par J.-L.-D. Féraud-Giraud,...

Appartient à l’ensemble documentaire : BbLevt0Contient une table des matièresAvec mode text

Institut de droit international. 3e commission d'étude. Du Régime légal des navires et de leur équipage dans les ports étrangers, communication de M. Féraud-Giraud,... [30 avril 1898.]

Appartient à l’ensemble documentaire : MAEDIGen0Appartient à l’ensemble documentaire : MAEDI011Avec mode text